Polynomially Bounded Sequences and Polynomial Sequences
نویسندگان
چکیده
In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we formalize polynomial sequences [5].
منابع مشابه
Algebra of Polynomially Bounded Sequences and Negligible Functions
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the ...
متن کاملA Spectral Sequence for Polynomially Bounded Cohomology
We construct an analogue of the Lyndon-HochschildSerre spectral sequence in the context of polynomially bounded cohomology. For G an extension of Q by H, this spectral sequences converges to the polynomially bounded cohomology of G, HP ∗(G). If the extension is a polynomial extension in the sense of Noskov with H and Q isocohomological and Q of type HF∞, the spectral sequence has E 2 -term HP (...
متن کاملOn the Spaces of $lambda _{r}$-almost Convergent and $lambda _{r}$-almost Bounded Sequences
The aim of the present work is to introduce the concept of $lambda _{r}$-almost convergence of sequences. We define the spaces $fleft( lambda _{r}right) $ and $f_{0}left( lambda _{r}right) $ of $ lambda _{r}$-almost convergent and $lambda _{r}$-almost null sequences. We investigate some inclusion relations concerning those spaces with examples and we determine the $beta $- and $gamma $-duals of...
متن کاملSome Remarks on Generalized Sequence Space of Bounded Variation of Sequences of Fuzzy Numbers
The idea of difference sequences of real (or complex) numbers was introducedby Ki zmaz cite{Kizmaz}. In this paper, using the difference operator and alacunary sequence, we introduce and examine the class of sequence $bv_{theta}left( Delta,mathcal{F}right) .$ We study some of its properties likesolidity, symmetricity, etc.
متن کاملLecture 4 - Computational Indistinguishability, Pseudorandom Generators
Definition 1. Let {Xn}, {Yn} be sequences of distributions withXn, Yn ranging over {0, 1}`(n) for some `(n) = nO(1). {Xn} and {Yn} are computationally indistinguishable (notation: Xn ≈ Yn) if for every polynomial-time A and polynomially-bounded , and sufficiently large n ∣∣Pr[A(Xn) = 1]− Pr[A(Yn) = 1]∣∣ ≤ (n) (If we want to nitpick, we’d give 1n as additional input to A to ensure it can run in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formalized Mathematics
دوره 23 شماره
صفحات -
تاریخ انتشار 2015